Data-Driven Distributionally Robust MPC for Constrained Stochastic Systems

نویسندگان

چکیده

In this letter we introduce a novel approach to distributionally robust optimal control that supports online learning of the ambiguity set, while guaranteeing recursive feasibility. We conic representable risk, which is useful derive tractable reformulations optimization problems. Specifically, illustrate techniques introduced, utilize risk measures constructed based on data-driven sets, constraining second moment random disturbance. setting, such moment-based lead controllers when combined with affine disturbance feedback. Assumptions constraints are given guarantee The resulting scheme acts as controller little data available and converges certainty equivalent large sample count implies high confidence in estimated moment. This illustrated numerical experiment.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Data-Driven Distributionally Robust Control of Energy Storage Systems

Energy storage is an important resource that can balance fluctuations in energy generation from renewable energy sources, such as wind, to increase their penetration. Many existing storage control methods require perfect information about probability distribution of uncertainties. In practice, however, the distribution of renewable energy production is difficult to reliably estimate. To resolve...

متن کامل

Data-driven Distributionally Robust Polynomial Optimization

We consider robust optimization for polynomial optimization problems where the uncertainty set is a set of candidate probability density functions. This set is a ball around a density function estimated from data samples, i.e., it is data-driven and random. Polynomial optimization problems are inherently hard due to nonconvex objectives and constraints. However, we show that by employing polyno...

متن کامل

Distributionally Robust Stochastic Programming

Abstract. In this paper we study distributionally robust stochastic programming in a setting 7 where there is a specified reference probability measure and the uncertainty set of probability mea8 sures consists of measures in some sense close to the reference measure. We discuss law invariance of 9 the associated worst case functional and consider two basic constructions of such uncertainty set...

متن کامل

Distributionally Robust Stochastic Programming

Abstract. In this paper we study distributionally robust stochastic programming in a setting 7 where there is a specified reference probability measure and the uncertainty set of probability mea8 sures consists of measures in some sense close to the reference measure. We discuss law invariance of 9 the associated worst case functional and consider two basic constructions of such uncertainty set...

متن کامل

Distributionally Robust Stochastic Knapsack Problem

This paper considers a distributionally robust version of a quadratic knapsack problem. In this model, a subsets of items is selected to maximizes the total profit while requiring that a set of knapsack constraints be satisfied with high probability. In contrast to the stochastic programming version of this problem, we assume that only part of information on random data is known, i.e., the firs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Control Systems Letters

سال: 2022

ISSN: ['2475-1456']

DOI: https://doi.org/10.1109/lcsys.2021.3091628